On the (un)decidability of a Near-unanimity Term

نویسندگان

  • MIKLÓS MARÓTI
  • B. A. Davey
  • L. Heindorf
چکیده

We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two fixed elements. On the other hand, based on Rosenberg’s characterization of maximal clones, we present partial results towards proving the decidability of the general problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finitely Related Algebras in Congruence Distributive Varieties Have Near Unanimity Terms

We show that every finite, finitely related algebra in a congruence distributive variety has a near unanimity term operation. As a consequence we solve the near unanimity problem for relational structures: it is decidable whether a given finite set of relations on a finite set admits a compatible near unanimity operation. This consequence also implies that it is decidable whether a given finite...

متن کامل

Few subpowers, congruence distributivity and near-unanimity terms

We prove that for any variety V, the existence of an edge-term (defined in [1]) and Jónsson terms is equivalent to the existence of a near-unanimity term. We also characterize the idempotent Maltsev conditions which are defined by a system of linear absorption equations and which imply congruence distributivity.

متن کامل

Near-Unanimity Functions and Varieties of Reflexive Graphs

Let H be a graph and k ≥ 3. A near-unanimity function of arity k is a mapping g from the k-tuples over V (H) to V (H) such that g(x1, x2, . . . , xk) is adjacent to g(x ′ 1, x ′ 2, . . . , x ′ k) whenever xix ′ i ∈ E(H) for each i = 1, 2, . . . , k, and g(x1, x2, . . . , xk) = a whenever at least k − 1 of the xi’s equal a. Feder and Vardi proved that, if a graph H admits a near-unanimity functi...

متن کامل

Unique Normalization for Shallow TRS

Computation with a term rewrite system (TRS) consists in the application of its rules from a given starting term until a normal form is reached, which is considered the result of the computation. The unique normalization (UN) property for a TRS R states that any starting term can reach at most one normal form when R is used, i.e. that the computation with R is unique. We study the decidability ...

متن کامل

Cord Blood Lipid Profile in Premature, Near-Term and Term Newborn Infants

Introduction: The fetus needs a considerable amount of cholesterol for the development of tissues and organs.  Studies have suggested that genetic and environmental factors influence the composition of cord blood lipoproteins.  In this study, we aim to assess the effect of gestational age, sex and birth weight on the cord blood lipoproteins. Methods: We collected umbilical cord blood samples fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006